Equational theories for inductive types
نویسندگان
چکیده
منابع مشابه
Equational Theories for Inductive Types
This paper provides characterisations of the equational theory of the per model of a typed lambda calculus with inductive types. The characterisation may be cast as a full abstraction result; in other words we show that the equations between terms valid in this model coincides with a certain syntactically defined equivalence relation. Along the way we give other characterisations of this equiva...
متن کاملPerfect Bases for Equational Theories
Perfect bases for equational theories are closely related to confluent and finitely terminating term rewrite systems. The two classes have a large overlap, but neither contains the other. The class of perfect bases is recursive. We also investigate a common generalization of both concepts; we call these more general bases normal, and touch the question of their uniqueness. We also give numerous...
متن کاملTurning Inductive into Equational Specifications
Inductively defined predicates are frequently used in formal specifications. Using the theorem prover Isabelle, we describe an approach to turn a class of systems of inductively defined predicates into a system of equations using data flow analysis; the translation is carried out inside the logic and resulting equations can be turned into functional program code in SML, OCaml or Haskell using t...
متن کاملInductive Synthesis of Equational Programs
An equational approach to the synthesis of functional and logic programs is taken. Typically, a target program contains equations that are only true in the standard model of the given domain rules. To synthesize such programs, induction is necessary. We propose heuristics for generalizing from a sequence of deductive consequences. These are combined with rewrite-based methods of inductive proof...
متن کاملConditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving
We propose a speciication language for the formalization of data types with partial or non-terminating operations as part of a rewrite-based logical framework for inductive theorem proving. The language requires constructors for designating data items and admits positive/negative conditional equations as axioms in speciications. The (total algebra) semantics for such speciications is based on s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1997
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(96)00021-8